Some properties of edge intersection graphs of single-bend paths on a grid
نویسندگان
چکیده
منابع مشابه
Edge intersection graphs of single bend paths on a grid
We combine the known notion of the edge intersection graphs of paths in a tree with a VLSI grid layout model to introduce the edge intersection graphs of paths on a grid. Let P be a collection of nontrivial simple paths on a grid G. We define the edge intersection graph EPG(P) of P to have vertices which correspond to the members of P, such that two vertices are adjacent in EPG(P) if the corres...
متن کاملEdge-intersection graphs of grid paths: the bend-number
We investigate edge-intersection graphs of paths in the plane grid regarding a parameter called the bend-number. The bend-number is related to the interval-number and the track-number of a graph. We provide new upper and lower bounds of the bend-number of any given simple graph in terms of the coloring number, edge clique covers and the maximum degree. We show that the bend-number of an outerpl...
متن کاملEdge-Intersection Graphs of k-Bend Paths in Grids
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications in conflict resolution of paths in grid networks. In this paper, we continue the study of edge-intersection graphs of paths in a grid, which was ...
متن کاملOn the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Golumbic, Lipshteyn and Stern proved that every graph can be represented as the edge intersection graph of paths on a grid, i.e., one can associate to each vertex of E-mail addresses: [email protected]; [email protected]; [email protected]; [email protected]; [email protected]; [email protected]; [email protected]. This work was partially supported by MathAmSud...
متن کاملRecognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid
We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, known as B0-VPG graphs. Recognizing these graphs is an NP-hard problem. In light of this, we focus on their subclasses. In the paper, we describe polynomial time algorithms for recognizing chordal B0-VPG graphs, and for recognizing B0-VPG graphs that have a representation on a grid ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.10.005